The undecidability of group announcements
نویسندگان
چکیده
This paper addresses and solves the long-standing open problem of whether Group Announcement Logic (GAL) is decidable. GAL is a dynamic epistemic logic for reasoning about which states of knowledge a group of agents can make come about by sharing their knowledge, with an operator for quantifying over all truthful public announcements that can be made by the group. We show that the satisfiability problem for the logic is undecidable; it is co-RE complete.
منابع مشابه
A Comparative Genre Analysis of Memorial Cards in English and Funeral/Memorial Announcements in Persian
As covert socio-cultural relations have significant effects on language, these norms are reflected in linguistic and generic structure of public death notices as a distinctive genre. This study intended to identify the different genres of death notices (e.g. memorial advertisements, obituaries, funeral announcements/posters, memorial cards, etc.) and to conduct a comparative genre analysis of m...
متن کاملSome undecidability results for asynchronous transducers and the Brin-Thompson group 2V
Using a result of Kari and Ollinger, we prove that the torsion problem for elements of the Brin-Thompson group 2V is undecidable. As a result, we show that there does not exist an algorithm to determine whether an element of the rational group R of Grigorchuk, Nekrashevich, and Sushchanskii has finite order. A modification of the construction gives other undecidability results about the dynamic...
متن کاملProviding an optimal model for gaining public trust in the Complaints System and Inspection Agency's announcements
This research seeks to provide an optimal model for gaining public trust in the Complaints System and Inspection Agency's announcements.In this research, a survey method and a researcher-made questionnaire were used. The study population was consist of customers and users of the complaint handling system and the organization's inspection reports in Mazandaran province comprising equal numbers o...
متن کاملOn the Identity Problem for the Special Linear Group and the Heisenberg Group
We study the identity problem for matrices, i.e., whether the identity matrix is in a semigroup generated by a given set of generators. In particular we consider the identity problem for the Special Linear Group following recent NP-completeness result for SL(2,Z) and the undecidability for SL(4,Z) generated by 48 matrices. In the seminal paper of Paterson in 1970, an injective morphism from pai...
متن کاملSocial Value of Information and Optimal Communication Policy of Central Banks
Monetary policy as a tool for expectations management is believed to be most effective if it can coordinate the beliefs and expectations of the economic agents. The optimal communication policy is in an environment where central bank announcements are common knowledge and abundant information is complete transparency. The above conclusion is altered in the more realistic situation where economi...
متن کامل